In memory of Alexander Schultz 1947–2020
نویسندگان
چکیده
منابع مشابه
Art.-Schultz (F)
Current theories view learning as the acquisition of specific predictions1–4. Humans and animals learn to predict the outcomes of their behavior, including rewards. Learning depends on the extent to which these outcomes are different than predicted, being governed by the discrepancy or ‘error’ between outcome and prediction. Outcomes that affect learning in this way are termed ‘reinforcers’. Le...
متن کاملthe effects of keyword and context methods on pronunciation and receptive/ productive vocabulary of low-intermediate iranian efl learners: short-term and long-term memory in focus
از گذشته تا کنون، تحقیقات بسیاری صورت گرفته است که همگی به گونه ای بر مثمر ثمر بودن استفاده از استراتژی های یادگیری لغت در یک زبان بیگانه اذعان داشته اند. این تحقیق به بررسی تاثیر دو روش مختلف آموزش واژگان انگلیسی (کلیدی و بافتی) بر تلفظ و دانش لغوی فراگیران ایرانی زیر متوسط زبان انگلیسی و بر ماندگاری آن در حافظه می پردازد. به این منظور، تعداد شصت نفر از زبان آموزان ایرانی هشت تا چهارده ساله با...
15 صفحه اولThe Modified Schultz Index of Trees
For a graph G = (V,E), the modified Schultz index of G is defined as S∗(G) = ∑ {u,v}⊂V (G) (dG(u) · dG(v))dG(u, v) where dG(u) (or d(u)) is the degree of the vertex u of G, and dG(u, v) is the distance between u and v. Lower bounds on modified Schultz index in trees in terms of the order and diameter are determined. Mathematics Subject Classification: 05C05, 05C12
متن کاملLieb-Schultz-Mattis in Higher Dimensions
A generalization of the Lieb-Schultz-Mattis theorem to higher dimensional spin systems is shown. The physical motivation for the result is that such spin systems typically either have long-range order, in which case there are gapless modes, or have only short-range correlations, in which case there are topological excitations. The result uses a set of loop operators, analogous to those used in ...
متن کاملExtremal Modified Schultz Index of Bicyclic Graphs
For a graph G = (V,E), the modified Schultz index of G is defined as S∗(G) = ∑ {u,v}⊆V (G) (dG(u) · dG(v))dG(u, v) where dG(u) (or d(u)) is the degree of the vertex u of G, and dG(u, v) is the distance between u and v. Let B(n) be the set of bicyclic graph with n vertices. In this paper, we study the modified Schultz index of B(n), graphs in B(n) with the smallest modified Schultz index S∗(G) a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scandinavian Journal of Urology
سال: 2020
ISSN: 2168-1805,2168-1813
DOI: 10.1080/21681805.2020.1831796